- Assign Vertex Colors
- Назначить цвета вершин
The terms and expressions program 3DS Max. English-Russian dictionary. 2014.
Assign Vertex Colors
Смотреть что такое "Assign Vertex Colors" в других словарях:
Erdős–Faber–Lovász conjecture — In graph theory, the Erdős–Faber–Lovász conjecture (1972) is a very deep problem about the coloring of graphs, named after Paul Erdős, Vance Faber, and László Lovász. It says::The union of k copies of k cliques intersecting in at most one vertex… … Wikipedia
Algorithmics of sudoku — The class of Sudoku puzzles consists of a partially completed row column grid of cells partitioned into N regions or zones each of size N cells, to be filled in using a prescribed set of N distinct symbols (typically the numbers {1, ..., N }), so … Wikipedia
Five color theorem — The five color theorem is a result from graph theory that given a plane separated into regions, such as a political map of the counties of a state, the regions may be colored using no more than five colors in such a way that no two adjacent… … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Bipartite graph — In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint sets U and V such that every edge connects a vertex in U to one in V ; that is, U and V are independent sets.… … Wikipedia
Distributed constraint optimization — (DCOP or DisCOP) is the distributed analogue to constraint optimization. A DCOP is a problem in which a group of agents must distributedly choose values for a set of variables such that the cost of a set of constraints over the variables is… … Wikipedia
Feynman graph — A Feynman graph is a graph suitable to be a Feynman diagram in a particular application of quantum field theory. (The most common use is when each field has quanta (particles) associated with it as the quantum of the electromagnetic field is a… … Wikipedia
Harmonious coloring — of 7 tree with 3 levels using 12 colors. The harmonius chromatic number of this graph is 12 since the vertices are 57, and the color s pair are ncolor*(ncolor 1)/2 >= 57 iff ncolor>=12. Moreover (3/2)*(7+1)=12(see Mitchem s Formula).In graph… … Wikipedia
cosmos — /koz meuhs, mohs/, n., pl. cosmos, cosmoses for 2, 4. 1. the world or universe regarded as an orderly, harmonious system. 2. a complete, orderly, harmonious system. 3. order; harmony. 4. any composite plant of the genus Cosmos, of tropical… … Universalium
Micropolygon — In 3D computer graphics, a micropolygon (or µ polygon) is a polygon that is very small relative to the image being rendered. Commonly, the size of a micropolygon is close to or even less than the area of a pixel. Micropolygons allow a renderer to … Wikipedia
